Calculations of Dihedral Groups Using Circular Indexation

نویسندگان

  • Reza Dianat Department of Electrical Engineering, Persian Gulf University
چکیده مقاله:

‎In this work‎, ‎a regular polygon with $n$ sides is described by a periodic (circular) sequence with period $n$‎. ‎Each element of the sequence represents a vertex of the polygon‎. ‎Each symmetry of the polygon is the rotation of the polygon around the center-point and/or flipping around a symmetry axis‎. ‎Here each symmetry is considered as a system that takes an input circular sequence and generates a processed circular output sequence‎. ‎The system can be described by a permutation function‎. ‎Permutation functions can be written in a simple form using circular indexation‎. ‎The operation between the symmetries of the polygon is reduced to the composition of permutation functions‎, ‎which in turn is easily implemented using periodic sequences‎. ‎It is also shown that each symmetry is effectively a pure rotation or a pure flip‎. ‎It is also explained how to synthesize each symmetry using two generating symmetries‎: ‎time-reversal (flipping around a fixed symmetry axis) and unit-delay (rotation around the center-point by $2pi‎ /‎n$ radians clockwise)‎. ‎The group of the symmetries of a polygon is called a dihedral group and it has applications in different engineering fields including image processing‎, ‎error correction codes in telecommunication engineering‎, ‎remote sensing, and radar‎.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Limits of Dihedral Groups

We give a characterization of limits of dihedral groups in the space of finitely generated marked groups. We also describe the topological closure of dihedral groups in the space of marked groups on a fixed number of generators.

متن کامل

Sumsets in dihedral groups

Let Dn be the dihedral group of order 2n. For all integers r, s such that 1 ≤ r, s ≤ 2n, we give an explicit upper bound for the minimal size μDn (r, s) = min |A · B| of sumsets (product sets) A · B, where A and B range over all subsets of Dn of cardinality r and s respectively. It is shown by construction that μDn (r, s) is bounded above by the known value of μG (r, s), where G is any abelian ...

متن کامل

Dihedral Groups Ii

1. Abstract characterization of Dn The group Dn has two generators r and s with orders n and 2 such that srs−1 = r−1. We will show any group with a pair of generators like r and s (except for their order) admits a homomorphism onto it from Dn, and is isomorphic to Dn if it has the same size as Dn. Theorem 1.1. Let G be generated by elements a and b where an = 1 for some n ≥ 3, b2 = 1, and bab−1...

متن کامل

On the eigenvalues of Cayley graphs on generalized dihedral groups

‎Let $Gamma$ be a graph with adjacency eigenvalues $lambda_1leqlambda_2leqldotsleqlambda_n$‎. ‎Then the energy of‎ ‎$Gamma$‎, ‎a concept defined in 1978 by Gutman‎, ‎is defined as $mathcal{E}(G)=sum_{i=1}^n|lambda_i|$‎. ‎Also‎ ‎the Estrada index of $Gamma$‎, ‎which is defined in 2000 by Ernesto Estrada‎, ‎is defined as $EE(Gamma)=sum_{i=1}^ne^{lambda_i}$‎. ‎In this paper‎, ‎we compute the eigen...

متن کامل

Harmonic analysis of dihedral groups

The rotations are the symmetries preserving the (cyclic) ordering of vertices. Thus, a rotation g is determined by the image gv, so the subgroup N of rotations has n elements. A reflection is an order-2 symmetry reversing the ordering of vertices. Imbedding the n-gon in R, there are n axes through which the n-gon can be reflected, so there are n reflections. Since |G| = 2n, every symmetry is ei...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 4  شماره 1

صفحات  37- 49

تاریخ انتشار 2019-06-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023